Quadratic residue codes over and their Gray images
نویسندگان
چکیده
منابع مشابه
Quadratic Residue Codes over F_p+vF_p and their Gray Images
In this paper quadratic residue codes over the ring Fp + vFp are introduced in terms of their idempotent generators. The structure of these codes is studied and it is observed that these codes share similar properties with quadratic residue codes over finite fields. For the case p = 2, Euclidean and Hermitian self-dual families of codes as extended quadratic residue codes are considered and two...
متن کاملGray Images of Constacyclic Codes over some Polynomial Residue Rings
Let be the quotient ring where is the finite field of size and is a positive integer. A Gray map of length over is a special map from to ( . The Gray map is said to be a ( )-Gray map if the image of any -constacyclic code over is a -constacyclic code over the field . In this paper we investigate the existence of ( )-Gray maps over . In this direction, we find an equivalent ...
متن کاملQuadratic Residue Codes over Z 9
A subset of n tuples of elements of Z9 is said to be a code over Z9 if it is a Z9-module. In this paper we consider an special family of cyclic codes over Z9, namely quadratic residue codes. We define these codes in term of their idempotent generators and show that these codes also have many good properties which are analogous in many respects to properties of quadratic residue codes over finit...
متن کاملGeneralized quadratic residue codes
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...
متن کاملLong Quadratic Residue Codes
A long standing problem has been to develop “good” binary linear block codes, C, to be used for error-correction. The length of the block is denoted n and the dimension of the code is denoted k. So in this notation C ⊆ GF (2) is a k-dimensional subspace. Another important parameter is the smallest weight of any non-zero codeword, d. This is related to error-correction because C can correct [d−1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2014
ISSN: 0022-4049
DOI: 10.1016/j.jpaa.2014.03.002